Class EdgeBetweenness

  • All Implemented Interfaces:
    Processable<Graph,​Graph>

    public class EdgeBetweenness
    extends ClusteringAlgorithm
    Edge Betweenness with Girvan Newman Algorithm https://en.wikipedia.org/wiki/Girvan%E2%80%93Newman_algorithm
    Author:
    Cesar Martin
    • Constructor Detail

    • Method Detail

      • process

        public java.util.ArrayList<Graph> process​(Graph graph)
        Performs Edge Betweenness community detection with Girvan-Newman algorithm a given Graph, returning the clustering with the maximum modularity.
        Parameters:
        graph - the Graph to perform FastGreedy on
        Returns:
        the list of Graphs representing the clustering with the maximum modularity